Completeness for Linear Regular Negation Normal Form Inference Systems
نویسندگان
چکیده
Completeness proofs that generalize the Anderson-Bledsoe excess literal argument are developed for calculi other than resolution. A simple proof of the completeness of regular, connected tableaux for formulas in conjunctive normal form (CNF) is presented. These techniques also provide completeness results for some inference mechanisms that do not rely on clause form. In particular, the completeness of regular, connected tableaux for formulas in negation normal form (NNF), and the completeness of NC-resolution under a linear restriction, are established.
منابع مشابه
Linearity and regularity with negation normal form
Proving completeness ofNC-resolution under a linear restriction has been elusive; it is proved here for formulas in negation normal form. The proof uses a generalization of the AndersonBledsoe excess literal argument, which was developed for resolution. That result is extended to NC-resolution with partial replacement. A simple proof of the completeness of regular, connected tableaux for formul...
متن کاملSome Remarks on Completeness , Connection Graph Resolutionand
A new completeness proof that generalizes the Anderson-Bledsoe excess literal argument is developed for connection-graph resolution. This technique also provides a simpliied completeness proof for semantic resolution. Some observations about subsumption and about link deletion are also made. Link deletion is the basis for connection graphs. Subsumption plays an important role in most resolution...
متن کاملTableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. T...
متن کاملKnowledge Compilation: Decomposable Negation Normal Form versus Linkless Formulas
Decomposable negation normal form (DNNF) was developed primarily for knowledge compilation. Formulas in DNNF are linkless, in negation normal form (NNF), and have the property that atoms are not shared across conjunctions. Full dissolvents are linkless NNF formulas that do not in general have the latter property. However, many of the applications of DNNF can be obtained with full dissolvents. T...
متن کاملA Logical Approach for Factoring Belief Networks
We have shown recently that a belief network can be represented as a polynomial and that many probabilistic queries can be recovered in constant time from the partial derivatives of such a polynomial. Although this polynomial is exponential in size, we have shown that it can be “computed” using an arithmetic circuit whose size is not necessarily exponential. Hence, the key computational questio...
متن کامل